/*
2021-11-12
https://leetcode-cn.com/problems/smallest-index-with-equal-value/
*/
class Solution {
public:
    int smallestEqual(vector<int>& nums) {
        int ans=-1;
        int idx=0;
        for(auto t:nums)
        {
            if(idx%10==t)
            {
                ans=idx;
                return ans;
            }
            idx++;
        }
        return ans;
    }
};
